Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

Unbounded parallel batch scheduling with job delivery to minimize makespan

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4. c © 2008 Published by Elsevier B.V.

On-line scheduling to minimize average completion time revisited

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...

Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time

Batch scheduling to minimize maximum lateness

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling

Online Over Time Scheduling on Parallel-Batch Machines: A Survey

Online scheduling is a rapidly developed branch in scheduling theory. In this paper, we present an extensive survey for online over time scheduling on parallel-batch machines. Some open problems are proposed for further research.